Quantum reading capacity: General definition and bounds

نویسندگان

  • Siddhartha Das
  • Mark M. Wilde
چکیده

Quantum reading refers to the task of reading out classical information stored in a classical memory. In any such protocol, the transmitter and receiver are in the same physical location, and the goal of such a protocol is to use these devices, coupled with a quantum strategy, to read out as much information as possible from a classical memory, such as a CD or DVD. In this context, a memory cell is a collection of quantum channels that can be used to encode a classical message in a memory. The maximum rate at which information can be read out from a given memory encoded with a memory cell is called the quantum reading capacity of the memory cell. As a consequence of the physical setup of quantum reading, the most natural and general definition for quantum reading capacity should allow for an adaptive operation after each call to the channel, and this is how we define quantum reading capacity in this paper. In general, an adaptive strategy can give a significant advantage over a non-adaptive strategy in the context of quantum channel discrimination, and this is relevant for quantum reading, due to its close connection with channel discrimination. In this paper, we provide a general definition of quantum reading capacity, and we establish several upper bounds on the quantum reading capacity of a memory cell. We also introduce an environment-parametrized memory cell, and we deliver second-order and strong converse bounds for its quantum reading capacity. We calculate the quantum reading capacities for some exemplary memory cells, including a thermal memory cell, a qudit erasure memory cell, and a qudit depolarizing memory cell. We finally provide an explicit example to illustrate the advantage of using an adaptive strategy in the context of zero-error quantum reading capacity.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Entanglement and secret-key-agreement capacities of bipartite quantum interactions and read-only memory devices

A bipartite quantum interaction corresponds to the most general quantum interaction that can occur between two quantum systems. In this work, we determine bounds on the capacities of bipartite interactions for entanglement generation and secret key agreement. Our upper bound on the entanglement generation capacity of a bipartite quantum interaction is given by a quantity that we introduce here,...

متن کامل

Results on Quantum Channel Capacity

It is shown that no source encoding is needed in the definition of the capacity of a quantum channel for transmitting entanglement. This capacity bounds the “protected subspace” capacity. We find the capacity of the quantum erasure channel using these results, without relying on an unproven assumption as in an earlier paper. Typeset using REVTEX 1

متن کامل

A Note on Runway Capacity Definition and Safety

The following is a discussion on the different aspects of the term capacity as well as a brief look at the commonly used capacity definitions in industrial and operations engineering in general and in Civil Aviation in particular. We maintain that quality factors (including more specifically here, safety) must be explicitly considered in runway capacity definition, and accordingly, we provide a...

متن کامل

Vocabulary Instruction Method and Specialized Reading Comprehension: Build a Bridge or Wash it away

The present study aimed to examine and compare the impact of teaching economic terms through etymological elaboration with three more conventional methods of vocabulary instruction in ESP courses in Iran, that is, teaching through contextual definitions, L1 translation, and implicit instruction on the learners' general comprehension of economic texts and their understanding of author's opinion....

متن کامل

Stronger Lower Bounds on Quantum OBDD for the Hidden Subgroup Problem

We consider the Hidden Subgroup in the context of quantum Ordered Binary Decision Diagrams. We show several lower bounds for this function. In this paper we also consider a slightly more general definition of the hidden subgroup problem (in contrast to that in [KH10]). It turns out that in this case the problem is intractable for the quantum OBDD. We prove exponential lower bounds for this func...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1703.03706  شماره 

صفحات  -

تاریخ انتشار 2017